Linear Transformation of Binary Decision Diagrams Trough Spectral Domain
نویسندگان
چکیده
We propose a new algorithm for linear transformation of BDD, by using of Walsh Hadamard coefficients of the represented function. This approach is based on the property that each spectral coefficient represents the measure of correlation between the function and the corresponding EXOR sum of variables. The proposed algorithm is applicable to large examples, and in many cases leads to substantially more compact diagrams when compared with simple Ordered BDD
منابع مشابه
Discrete Function Representations Utilizing Decision Diagrams and Spectral Techniques
All discrete function representations become exponential in size in the worst case. Binary decision diagrams have become a common method of representing discrete functions in computer-aided design applications. For many functions, binary decision diagrams do provide compact representations. This work presents a way to represent large decision diagrams as multiple smaller partial binary decision...
متن کاملEVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition
Edge Valued Binary Decision Diagrams evbdd s are directed acyclic graphs which can represent and manipulate integer functions as e ectively as Ordered Binary Decision Di agrams obdds do for Boolean functions They have been used in logic veri cation for showing the equivalence between Boolean functions and arithmetic functions In this paper we present evbdd based algorithms for solving integer l...
متن کاملQMDD and Spectral Transformation of Binary and Multiple-Valued Functions*
The use of decision diagrams (DD) for the computation and representation of binary function spectra has been well studied [2,3,5]. Computations and representation of spectra for multiplevalued logic (MVL) functions have also been considered [6]. For binary functions, this approach can be implemented using one of a number of the highly efficient publicly available binary decision diagram (BDD) p...
متن کاملApproximate Algorithms for Minimization of Binary Decision Diagrams on the Basis of Linear Transformations of Variables
Algorithms for an approximate minimization of binary decision diagrams (BDD) on the basis of linear transformations of variables are proposed. The algorithms rely on the transformations of only adjacent variables and have a polynomial complexity relative to the size of the table that lists values of the function involved.
متن کاملReduction of the Number of Paths in Binary Decision Diagrams by Linear Transformation of Variables
The paper deals with the problem of counting and minimizing the number of paths in Binary Decision Diagrams. The suggested approach uses the linear transform of initial variables and is based on a newly introduced weighted autocorrelation function. It is shown that the total number of paths in BDD is the sum of values of a weighted autocorrelation function. The efficiency of the proposed techni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006